CAML—Maximum likelihood consensus analysis

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Empirical Likelihood Approach and its Application on Survival Analysis

A number of nonparametric methods exist when studying the population and its parameters in the situation when the distribution is unknown. Some of them such as "resampling bootstrap method" are based on resampling from an initial sample. In this article empirical likelihood approach is introduced as a nonparametric method for more efficient use of auxiliary information to construct...

متن کامل

FlexCCT: Software for Maximum Likelihood Cultural Consensus Theory

In this paper, we describe a software package called FlexCCT for analyzing numerical ratings data. FlexCCT is implemented in MATLAB and incorporates a range of different cultural consensus theory (CCT) models. We describe the standalone GUI version of FlexCCT. We give an illustrative example, showing how FlexCCT can be used to analyze and interpret essay rating data.

متن کامل

Likelihood Component Analysis

Independent component analysis (ICA) is popular in many applications, including cognitive neuroscience and signal processing. Due to computational constraints, principal component analysis is used for dimension reduction prior to ICA (PCA+ICA), which could remove important information. The problem is that interesting independent components (ICs) could be mixed in several principal components th...

متن کامل

Likelihood Analysis of Zero Inflation

We consider a random count variable Y with pmf πy = πy(θ). Typically, interest lies in inference on parameters β defining θi = θ(xiβ) given observations {(yi, xi); i = 1, . . . n}. However, Y is latent, or imperfectly observed; it thus provides an imperfect source of inference on β. We refer to observations yi as realisations of an observable random variable Ỹ and denote its pmf by π̃y = πy(κ, θ...

متن کامل

Maximum Likelihood Analysis of Heapsort

We present a new approach for an average-cases analysis of algorithms that supports a non-uniform distribution of the inputs and is based on the maximum likelihood training of stochastic grammars. The approach is exemplified by an analysis of the average running time of heapsort. All but one step of our analysis can be automated on top of a computer-algebra system. Thus our new approach eases t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Behavior Research Methods

سال: 2011

ISSN: 1554-3528

DOI: 10.3758/s13428-011-0138-0